An effective version of Dilworth’s theorem
نویسندگان
چکیده
منابع مشابه
Fully Mechanized Proofs of Dilworths Theorem and Mirskys Theorem
We present two fully mechanized proofs of Dilworth’s and Mirsky’s theorems in the Coq proof assistant. Dilworth’s Theorem states that in any finite partially ordered set (poset), the size of a smallest chain cover and a largest antichain are the same. Mirsky’s Theorem is a dual of Dilworth’s Theorem. We formalize the proofs by Perles [2] (for Dilworth’s Theorem) and by Mirsky [5] (for the dual ...
متن کاملTowards an Effective Version of a Theorem of Stafford
Simplifying a matrix of differential operators by elementary row and column operations is quite a fundamental task. If one considers matrices whose entries are ordinary timevarying differential operators with rational function coefficients (or more generally meromorphic functions) then a classical theorem tells you that by elementary row and column operations an analogue to the Smith form can b...
متن کاملAn Effective Version of Kronecker’s Theorem on Simultaneous Diophantine Approximation
Kronecker’s theorem states that if 1, θ1, . . . , θn are real algebraic numbers, linearly independent over Q, and if α ∈ R, then for any > 0 there are q ∈ Z and p ∈ Z such that |qθi − αi − pi| < . Here, a bound on q is given in terms of the dimension n, of the precision , of the degree of the θi’s and of their height. A possible connection to the square-root sum problem is discussed.
متن کاملAn effective version of Wilkie's theorem of the complement and some effective o-minimality results
Wilkie (1999) proved a “theorem of the complement” which implies that in order to establish the o-minimality of an expansion of R with C∞ functions it suffices to obtain uniform (in the parameters) bounds on the number of connected components of quantifier free definable sets. He deduced that any expansion of R with a family of Pfaffian functions is o-minimal. We prove an effective version of W...
متن کاملEffective version of the Shannon theorem: Polar codes
A sequence of codes Cn = fn(Mn), n ≥ 1 is said to attain the transmission rate I(W ) on the channel W if for any ε > 0 there exists a sufficiently large n0 such that for all n ≥ n0 bothR > I(W )−ε and Pe(Cn) ≤ ε. Below we construct a sequence of linear binary codes Cn, n ≥ 1 of length N = 2 that attains the rate I(W ) of the channelW . For symmetric binary-input channels these codes are capacit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1981
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1981-0628446-x